Elements of complex structures , where recursion isn ’ t

نویسنده

  • Masayoshi Shibatani
چکیده

In their recent work, Hauser, Chomsky and Fitch (2002:1569) suggest that recursion “is the only uniquely human component of the faculty of language”. In both generative and typological studies, the relativization site has been considered to be one of the places where recursion of sentences takes place. This paper examines a number of wide-spread patterns of relativization around the globe and argues that what have been identified as relative clauses/sentences are in fact nominalized entities, lacking some crucial properties of both full clauses and sentences. It is furthermore shown that these nominalized forms are neither syntactically nor semantically subordinate to, or dependent on, the nominal head they modify.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculation for Energy of (111) Surfaces of Palladium in Tight Binding Model

In this work calculation of energetics of transition metal surfaces is presented. The tight-binding model is employed in order to calculate the energetics. The tight-binding basis set is limited to d orbitals which are valid for elements at the end of transition metals series. In our analysis we concentrated on electronic effects at temperature T=0 K, this means that no entropic term will be pr...

متن کامل

Some remarks on the combinatorics of ISn

We describe the asymptotic behavior of the cardinalities of the finite symmetric inverse semigroup ISn and its endomorphism semigroup. This is applied to show that |ISn|/|End(ISn)| is asymptotically 0, solving a problem of Schein and Teclezghi. We also apply our results to compute the distributions of elements from ISn with respect to certain combinatorial properties, and to compute the generat...

متن کامل

Combinatorics and distributions of partial injections

We obtain several combinatorial results about chains, cycles and orbits of the elements of the symmetric inverse semigroup ISn and the set Tn of nilpotent elements in ISn. We also get some estimates for the growth of |ISn| and |Tn|, and study random products of elements from ISn.

متن کامل

N ov 2 00 5 Combinatorics and distributions of partial injections

We obtain several combinatorial results about chains, cycles and orbits of the elements of the symmetric inverse semigroup ISn and the set Tn of nilpotent elements in ISn. We also get some estimates for the growth of |ISn| and |Tn|, and study random products of elements from ISn.

متن کامل

Which elements of a finite group are non-vanishing?

‎Let $G$ be a finite group‎. ‎An element $gin G$ is called non-vanishing‎, ‎if for‎ ‎every irreducible complex character $chi$ of $G$‎, ‎$chi(g)neq 0$‎. ‎The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$‎, ‎is an undirected graph with‎ ‎vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G‎, ‎ tin T}$‎. ‎Let ${rm nv}(G)$ be the set‎ ‎of all non-vanishi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009